Interval Set Cluster Analysis: A Re-formulation

نویسندگان

  • Yiyu Yao
  • Pawan Lingras
  • Ruizhi Wang
  • Duoqian Miao
چکیده

A new clustering strategy is proposed based on interval sets, which is an alternative formulation different from the ones used in the existing studies. Instead of using a single set as the representation of a cluster, each cluster is represented by an interval set that is defined by a pair of sets called the lower and upper bounds. Elements in the lower bound are typical elements of the cluster and elements between the upper and lower bounds are fringe elements of the cluster. A cluster is therefore more realistically characterized by a set of core elements and a set of boundary elements. Two types of interval set clusterings are proposed, one is non-overlapping lower bound interval set clustering and the other is overlapping lower bound interval set clusterings, corresponding to the standard partition based and covering based clusterings.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An improved adaptive weighted clustering algorithm based on time interval grade in Mobile Ad Hoc networks

Mobile Ad Hoc Networks (MANETs) are self-configuring dynamic networks of mobile devices connected by wireless links without any fixed infrastructure or centralized administration. In order to achieve stable clusters, the cluster-heads (CHs) maintaining the cluster should be stable with minimum re-affiliation times and number of changes on CHs, with maximal throughput of the clustering formation...

متن کامل

Centroid of an Interval Type-2 Fuzzy Set Re-Formulation of the Problem

In theory of interval type-2 (IT2) fuzzy sets, type-reduction is one of the most difficult parts. Karnik-Mendel (KM) algorithms have been the most popular method for computing type-reduction of IT2 fuzzy sets. These algorithms present two independent procedures for computing the generalized centroid of an IT2 fuzzy set: the first one for computing its left part (denoted by cl), and the second o...

متن کامل

A survey on exact methods for minimum sum-of-squares clustering

Minimum sum-of-squares clustering (MSSC) consists in partitioning a given set of n entities into k clusters in order to minimize the sum of squared distances from the entities to the centroid of their cluster. Among many criteria used for cluster analysis, the minimum sum-of-squares is one of the most popular since it expresses both homogeneity and separation. A mathematical programming formula...

متن کامل

Analytical aspects of the interval unilateral quadratic matrix equations and their united solution sets

This paper introduces the emph{interval unilateral quadratic matrix equation}, $IUQe$ and attempts to find various analytical results on its AE-solution sets in which $A,B$ and $CCC$ are known real interval matrices, while $X$ is an unknown matrix. These results are derived from a generalization of some results of Shary. We also give sufficient conditions for non-emptiness of some quasi-solutio...

متن کامل

بازشناسی جلوه‌های هیجانی با استفاده از تحلیل تفکیک پذیری مبتنی بر خوشه بندی چهره

Improvement of Facial expression recognition is aim of proposed method. This is a new formulation to the linear discriminant analysis. In the new formulation within-class and between-class covariance matrix are estimated on the each cluster and in the test phase new samples are mapped to the subspace that is related to the cluster of them. At the first we addressed clustering analysis of faces ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009